منابع مشابه
Batch cooling solution crystallization of ammonium oxalate in the presence of impurities: Study of solubility, supersaturation, and steady-state inhibition
When compared to equilibrium data in pure solvent, variations of solubility are frequently observed in the presence of dissolved impurities. It is also well-known that impurities can inhibit the crystallization processes and lead to supersaturation barriers below which the growth of crystals is cancelled. However, many papers dealing with the inhibiting effects of impurities in solution crystal...
متن کاملCrystal Nucleation without Supersaturation.
Classical nucleation theory (CNT) has been extensively employed to interpret crystal nucleation phenomena and postulates the formation of an ordered crystalline nucleus directly from vapor or solution. Here, we provide the first experimental demonstration of a two-step mechanism that facilitates deposition of crystals on solid surfaces from vapor. Crucially, this occurs from saturated vapor wit...
متن کاملSupersaturation for hereditary properties
Let F be a collection of r-uniform hypergraphs, and let 0 < p < 1. It is known that there exists c = c(p,F) such that the probability of a random r-graph in G(n, p) not containing an induced subgraph from F is 2(−c+o(1))( n r). Let each r-graph in F have at least t vertices. We show that in fact for every > 0, there exists δ = δ( , p,F) > 0 such that the probability of a random r-graph in G(n, ...
متن کاملSupersaturation in the Boolean lattice
We prove a “supersaturation-type” extension of both Sperner’s Theorem (1928) and its generalization by Erdős (1945) to k-chains. Our result implies that a largest family whose size is x more than the size of a largest k-chain free family and that contains the minimum number of k-chains is the family formed by taking themiddle (k−1) rows of the Boolean lattice and x elements from the kthmiddle r...
متن کاملSupersaturation and stability for forbidden subposet problems
We address a supersaturation problem in the context of forbidden subposets. A family F of sets is said to contain the poset P if there is an injection i : P → F such that p ≤P q implies i(p) ⊂ i(q). The poset on four elements a, b, c, d with a, b ≤ c, d is called a butterfly. The maximum size of a family F ⊆ 2 that does not contain a butterfly is ( n bn/2c ) + ( n bn/2c+1 ) as proved by De Boni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: School Science and Mathematics
سال: 1919
ISSN: 0036-6803
DOI: 10.1111/j.1949-8594.1919.tb12404.x